Link Prediction Algorithm Based on Node Structure Similarity Measured by Relative Entropy

نویسندگان

چکیده

Abstract To solve the problem that link prediction method based on local information ignores influence of neighbor structure similarity measurement nodes, a relative entropy and nodes is proposed. Firstly, second-order network introduced to describe nodes; then, structural between described by redefining entropy; finally, measured entropy, index node proposed considering neighbor. Experimental results 7 real data sets show can achieve better be applied networks with small average aggregation coefficient compared other indexes global information, also have performance large-scale networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Link Prediction using Network Embedding based on Global Similarity

Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...

متن کامل

Link prediction based on path entropy

Information theory has been taken as a prospective tool for quantifying the complexity of complex networks. In this paper, we first study the information entropy or uncertainty of a path using the information theory. Then we apply the path entropy to the link prediction problem in real-world networks. Specifically, we propose a new similarity index, namely Path Entropy (PE) index, which conside...

متن کامل

Providing a Link Prediction Model based on Structural and Homophily Similarity in Social Networks

In recent years, with the growing number of online social networks, these networks have become one of the best markets for advertising and commerce, so studying these networks is very important. Most online social networks are growing and changing with new communications (new edges). Forecasting new edges in online social networks can give us a better understanding of the growth of these networ...

متن کامل

Entropy-based link prediction in weighted networks

Information entropy has been proved to be an effective tool to quantify the structural importance of complex networks. In the previous work (Xu et al, 2016 [31]), we measure the contribution of a path in link prediction with information entropy. In this paper, we further quantify the contribution of a path with both path entropy and path weight, and propose a weighted prediction index based on ...

متن کامل

An Adaptation Algorithm for Adaptive Web Based Systems based on Link Structure and Document Similarity

Many traditional adaptive web based systems today are complex in its design and implementation which makes them hard to implement in general purpose web sites. The lack of efficient approach and adaptation algorithm makes their usage in isolated cases like: e-commerce sites or only education systems. In this paper we introduce a new adaptation algorithm based on web sites link structure and doc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of physics

سال: 2021

ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']

DOI: https://doi.org/10.1088/1742-6596/1955/1/012078